Implementation of Policing Mechanisms for High Speed Networks

This paper proposes implementations of the well-known traffic policing mechanisms for high speed networks. The implementations are based on a high performance development environment and are described through commented block diagrams. The considered mechanisms are Leaky Bucket with variants, Jumping Window, Triggered Jumping Window, Continuous Sliding Window, Discretized Sliding Window and Time Slotted Moving Window. These mechanisms were implemented in UNIX and DOS environments. A comparison of the results focusing on the implementation complexity is presented considering required memory, number of timers and its precision, mean processing time of the communication system and mean mechanism processing time. The results confirm the low implementation complexity of Leaky Bucket, Jumping Window and Time Slotted Moving Window mechanisms.